//=======================^========================================================^=======================\\
/*
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * * * * * *
*/
//=======================^========================================================^=======================\\
#include<iostream>
#include<math.h>
#include<stdlib.h>
// #include<bits/stdc++.h>
#include<string.h>
#include<ctype.h>
#include<set>
#include<vector>
#include <algorithm>
#include<map>
#define test ll t;cin>>t;while(t--)
#define ll long long int
#define lld long double
#define setfor for(auto it: s1)
#define parthparekh ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define fi(l,r) for(ll i = l; i < r; i++)
#define fj(l,r) for(ll j = l; j < r; j++)
#define fk(l,r) for(ll k = l; k < r; k++)
#define fir(r,l) for(ll i=r;i>=l;i--)
#define fjr(r,l) for(ll j=r;j>=l;j--)
#define pb push_back
#define em emplace_back
#define yy cout<<"YES\n"
#define nn cout<<"NO\n"
using namespace std;
int main()
{
parthparekh;
ll n,m,a,b,ans=0,ans1=0;
cin>>n>>m>>a>>b;
if(n%m==0)
cout<<0<<endl;
else
{
ans=(n%m)*b;
ans1=(m-(n%m))*a;
cout<<min(ans,ans1)<<endl;
}
}1351. Count Negative Numbers in a Sorted Matrix | 617. Merge Two Binary Trees |
1450. Number of Students Doing Homework at a Given Time | 700. Search in a Binary Search Tree |
590. N-ary Tree Postorder Traversal | 589. N-ary Tree Preorder Traversal |
1299. Replace Elements with Greatest Element on Right Side | 1768. Merge Strings Alternately |
561. Array Partition I | 1374. Generate a String With Characters That Have Odd Counts |
1822. Sign of the Product of an Array | 1464. Maximum Product of Two Elements in an Array |
1323. Maximum 69 Number | 832. Flipping an Image |
1295. Find Numbers with Even Number of Digits | 1704. Determine if String Halves Are Alike |
1732. Find the Highest Altitude | 709. To Lower Case |
1688. Count of Matches in Tournament | 1684. Count the Number of Consistent Strings |
1588. Sum of All Odd Length Subarrays | 1662. Check If Two String Arrays are Equivalent |
1832. Check if the Sentence Is Pangram | 1678. Goal Parser Interpretation |
1389. Create Target Array in the Given Order | 1313. Decompress Run-Length Encoded List |
1281. Subtract the Product and Sum of Digits of an Integer | 1342. Number of Steps to Reduce a Number to Zero |
1528. Shuffle String | 1365. How Many Numbers Are Smaller Than the Current Number |